New Multiparametric Similarity Measure and Distance Measure for Interval Neutrosophic Set With IoT Industry Evaluation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTERVAL-VALUED INTUITIONISTIC FUZZY SETS AND SIMILARITY MEASURE

In this paper, the problem of measuring the degree of inclusion and similarity measure for two   interval-valued intuitionistic  fuzzy sets is considered. We propose inclusion and similarity measure by using  order on interval-valued intuitionistic fuzzy sets connected with lexicographical order. Moreover, some properties of inclusion and similarity measure and some correlation, between them an...

متن کامل

Cosine Similarity Measure of Interval Valued Neutrosophic Sets

In this paper, we define a new cosine similarity between two interval valued neutrosophic sets based on Bhattacharya’s distance [19]. The notions of interval valued neutrosophic sets (IVNS, for short) will be used as vector representations in 3D-vector space. Based on the comparative analysis of the existing similarity measures for IVNS, we find that our proposed similarity measure is better an...

متن کامل

Said Broumi and Florentin Smarandache Cosine Similarity Measure of Interval Valued Neutrosophic Sets Cosine Similarity Measure of Interval Valued Neutrosophic Sets

In this paper, we define a new cosine similarity between two interval valued neutrosophic sets based on Bhattacharya’s distance [19]. The notions of interval valued neutrosophic sets (IVNS, for short) will be used as vector representations in 3D-vector space. Based on the comparative analysis of the existing similarity measures for IVNS, we find that our proposed similarity measure is better an...

متن کامل

Similarity search with set intersection as a distance measure

This thesis deals with a fundamental algorithmic problem. Given a database of sets and a query set, we want to determine a set from the database that has a maximal intersection with the query set. It is allowed to preprocess the database so that queries can be answered efficiently. We solve the approximate version of this problem. We investigate two randomized input models which are derived fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2019

ISSN: 2169-3536

DOI: 10.1109/access.2019.2902148